Homogeneous models and decidability
نویسندگان
چکیده
منابع مشابه
Decidability of All Minimal Models
This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows a proof of the existence of a cellular term in each observational equivalence class of a minimal model. The first proof I gave of the decidability of all minimal models [3] was far from being easy to understand. I was only an inexperienced studen...
متن کاملComputable Trees, Prime Models, and Relative Decidability
We show that for every computable tree T with no dead ends and all paths computable, and every D >T ∅, there is a D-computable listing of the isolated paths of T . It follows that for every complete decidable theory T such that all the types of T are computable and every D >T ∅, there is a D-decidable prime model of T . This result extends a theorem of Csima and yields a stronger version of the...
متن کاملDiscrete Time Homogeneous and non-Homogeneous semi-Markov Reliability Models.∗
In this paper, we extend to our knowledge, for the first case, some reliability results obtained using homogeneous semi-Markov processes to the case of non-homogenous semi-Markov modelisation. Moreover, we apply some of our preceding results to give the numerical solutions and so the possibility to treat real life problems for which non-homogeneity in time is important.
متن کاملBounding homogeneous models
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram D(A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithmetic) is homogeneous bounding. We prove that in fact a degree is homogeneous bounding if and only if...
متن کاملhomogeneous - universal ’ models
Classes with few models have 'homogeneous-universal' models This paper is concerned with a class K of models and an abstract notion of submodel ≤. Experience in first order model theory has shown the desirability of finding a 'monster model' to serve as a universal domain for K. In the original constructions of Jónsson and Fraissè, K was a universal class and ordinary substructure played the ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1980
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1980.91.407